Efficient Nonrecursive Bit-Parallel Karatsuba Multiplier for a Special Class of Trinomials
نویسندگان
چکیده
منابع مشابه
Mastrovito form of Karatsuba Multiplier for All Trinomials
We present a Matrix-vector form of Karatsuba multiplication over GF (2m) generated by an irreducible trinomial. Based on shifted polynomial basis (SPB), two Mastrovito matrices for different Karatsuba multiplication parts are studied. Then related multiplier architecture is proposed. This design effectively exploits the overlapped entries of the Mastrovito matrices to reduce the space complexit...
متن کاملNew bit-parallel Montgomery multiplier for trinomials using squaring operation
In this paper, a new bit-parallel Montgomery multiplier for GF (2) is presented, where the field is generated with an irreducible trinomial. We first present a slightly generalized version of a newly proposed divide and conquer approach. Then, by combining this approach and a carefully chosen Montgomery factor, the Montgomery multiplication can be transformed into a composition of small polynom...
متن کاملLow complexity bit parallel multiplier for GF(2m) generated by equally-spaced trinomials
Based on the shifted polynomial basis (SPB), a high efficient bit-parallel multiplier for the field GF(2m) defined by an equallyspaced trinomial (EST) is proposed. The use of SPB significantly reduces time delay of the proposed multiplier and at the same time Karatsuba method is combined with SPB to decrease space complexity. As a result, with the same time complexity, approximately 3/4 gates o...
متن کاملParallel Itoh-Tsujii multiplicative inversion algorithm for a special class of trinomials
In this contribution, we derive a novel parallel formulation of the standard Itoh-Tsujii algorithm for multiplicative inverse computation overGF(2m). The main building blocks used by our algorithm are: field multiplication, field squaring and field square root operators. It achieves its best performance when using a special class of irreducible trinomials, namely, P (X) = Xm +Xk + 1, withm and ...
متن کاملEfficient Large Numbers Karatsuba-Ofman Multiplier Designs for Embedded Systems
Long number multiplications (n ≥ 128-bit) are a primitive in most cryptosystems. They can be performed better by using Karatsuba-Ofman technique. This algorithm is easy to parallelize on workstation network and on distributed memory, and it’s known as the practical method of choice. Multiplying long numbers using Karatsuba-Ofman algorithm is fast but is highly recursive. In this paper, we propo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: VLSI Design
سال: 2018
ISSN: 1065-514X,1563-5171
DOI: 10.1155/2018/9269157